Counting Occurrences of Some Subword Patterns Alexander Burstein and Toufik Mansour
نویسنده
چکیده
We find generating functions for the number of strings (words) containing a specified number of occurrences of certain types of order-isomorphic classes of substrings called subword patterns. In particular, we find generating functions for the number of strings containing a specified number of occurrences of a given 3-letter subword pattern.
منابع مشابه
Counting occurrences of some subword patterns
Counting the number of words which contain a set of given strings as substrings a certain number of times is a classical problem in combinatorics. This problem can, for example, be attacked using the transfer matrix method (see [20, Section 4.7]). In particular, it is a well-known fact that the generating function of such words is always rational. For example, in [20, Example 4.7.5] it is shown...
متن کاملCounting Independent Sets in Some Classes of (almost) Regular Graphs
We enumerate the independent sets of several classes of regular and almost regular graphs and compute the corresponding generating functions. We also note the relations between these graphs and other combinatorial objects and, in some cases, construct the corresponding bijections.
متن کاملThe Peano curve and counting occurrences of some patterns
We introduce Peano words, which are words corresponding to finite approximations of the Peano space filling curve. We then find the number of occurrences of certain patterns in these words.
متن کاملCounting Subwords in a Partition of a Set
A partition π of the set [n] = {1, 2, . . . , n} is a collection {B1, . . . , Bk} of nonempty disjoint subsets of [n] (called blocks) whose union equals [n]. In this paper, we find explicit formulas for the generating functions for the number of partitions of [n] containing exactly k blocks where k is fixed according to the number of occurrences of a subword pattern τ for several classes of pat...
متن کاملCounting subwords in flattened partitions of sets
In this paper, we consider the problem of avoidance of subword patterns in flattened partitions, which extends recent work of Callan. We determine in all cases explicit formulas and/or generating functions for the number of set partitions of size n which avoid a single subword pattern of length three. The asymptotic behavior of the resulting counting sequences turns out to depend quite heavily ...
متن کامل